Algorithms for subelliptic multipliers in $\mathbb {C}^2$

We give examples of pseudoconvex domains finite type in C 2 \mathbb {C}^2 where the Kohn algorithm for subelliptic estimates fails to yield an effective lower bound order subellipticity terms type. show how modify obtain procedure prove on with real analytic boundary satisfying a condition slightly stronger than pseudoconvexity. close generalization higher dimensions.